A Hybrid Heuristic Algorithm Using Artificial Agents for Data Replication Problem in Distributed Systems

نویسندگان

چکیده

One of the key issues with large distributed systems, such as IoT platforms, is gaining timely access to data objects. As a result, decreasing operation time reading and writing in communication systems become essential demands for asymmetric system. A common method replicate objects across multiple servers. Replica placement, which can be performed statically or dynamically, critical effectiveness general. Replication placing them on best available servers an optimal manner NP-complete optimization problem. several heuristic strategies replica placement have been presented. The primary goals this research are reduce cost time, number replicas, increase reliability algorithms replicas. In paper, discretized algorithm artificial individuals hybrid imitation were developed. proposed method, particle gray-wolf-based use local memory velocity search solutions. includes symmetry both global searches. Another contribution development solving object replication problem systems. Regarding results simulations standard benchmark, suggested gives 35% reduction about six replicates. Furthermore, deviation among obtained by 0.015 lower than other methods same experiments; hence, more stable previous during different executions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hybrid Meta-heuristic Algorithm for Task Assignment Problem

Task assignment problem (TAP) involves assigning a number of tasks to a number of processors in distributed computing systems and its objective is to minimize the sum of the total execution and communication costs, subject to all of the resource constraints. TAP is a combinatorial optimization problem and NP-complete. This paper proposes a hybrid meta-heuristic algorithm for solving TAP in a ...

متن کامل

A Hybrid Modified Meta-heuristic Algorithm for Solving the Traveling Salesman Problem

The traveling salesman problem (TSP) is one of the most important combinational optimization problems that have nowadays received much attention because of its practical applications in industrial and service problems. In this paper, a hybrid two-phase meta-heuristic algorithm called MACSGA used for solving the TSP is presented. At the first stage, the TSP is solved by the modified ant colony s...

متن کامل

hybrid meta-heuristic algorithm for task assignment problem

task assignment problem (tap) involves assigning a number of tasks to a number of processors in distributed computing systems and its objective is to minimize the sum of the total execution and communication costs, subject to all of the resource constraints. tap is a combinatorial optimization problem and np-complete. this paper proposes a hybrid meta-heuristic algorithm for solving tap in a h...

متن کامل

Harmonics Estimation in Power Systems using a Fast Hybrid Algorithm

In this paper a novel hybrid algorithm for harmonics estimation in power systems is proposed. The estimation of the harmonic components is a nonlinear problem due to the nonlinearity of phase of sinusoids in distorted waveforms. Most researchers implemented nonlinear methods to extract the harmonic parameters. However, nonlinear methods for amplitude estimation increase time of convergence. Hen...

متن کامل

Hybrid Heuristic Algorithm for GPS Surveying Problem

This paper introduces several approaches based on ant colony optimization for efficient scheduling the surveying activities of designing satellite surveying networks. These proposed approaches use a set of agents called ants that cooperate to iteratively construct potential observation schedules. Within the context of satellite surveying, a positioning network can be defined as a set of points ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Symmetry

سال: 2023

ISSN: ['0865-4824', '2226-1877']

DOI: https://doi.org/10.3390/sym15020487